Directional Newton methods in n variables
نویسندگان
چکیده
Directional Newton methods for functions f of n variables are shown to converge, under standard assumptions, to a solution of f (x) = 0. The rate of convergence is quadratic, for near-gradient directions, and directions along components of the gradient of f with maximal modulus. These methods are applied to solving systems of equations without inversion of the Jacobian matrix.
منابع مشابه
A semilocal convergence analysis for directional Newton methods
A semilocal convergence analysis for directional Newton methods in n-variables is provided in this study. Using weaker hypotheses than in the elegant related work by Y. Levin and A. Ben-Israel and introducing the center-Lipschitz condition we provide under the same computational cost as in Levin and Ben-Israel a semilocal convergence analysis with the following advantages: weaker convergence co...
متن کاملAircraft Parameter Estimation using Neural Network based Algorithm
Aircraft Parameter estimation is probably the most outstanding and illustrated example of the system identification methodology. In the past the most widely used parameter estimation methods have been Equation error method, Output error method, Maximum likelihood method and Filter error method. In this paper an algorithm based on neural modeling and Gauss-Newton optimization is proposed to esti...
متن کاملOn Multivariate Lagrange Interpolation
Lagrange interpolation by polynomials in several variables is studied through a finite difference approach. We establish an interpolation formula analogous to that of Newton and a remainder formula, both of them in terms of finite differences. We prove that the finite difference admits an integral representation involving simplex spline functions. In particular, this provides a remainder formul...
متن کاملLarge-Scale Dynamic Optimization with the Directional Second Order Adjoint Method
Efficient solution of large-scale dynamic optimization problems can be achieved by exploiting the advantages of state-of-the-art integration and large-scale nonlinear programming tools. TruncatedNewton method provides an effective way to solve large-scale optimization problems by achieving savings in computation and storage. For dynamic optimization, the Hessian-vector products required by thes...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002